No . STAN - CS - 80 - 786 ‘ January 1980 ALGORITHMS IN MODERN MATHEMATICS AND COMPUTER SCIENCE
نویسنده
چکیده
منابع مشابه
Solving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملOn the Addition of Binary Numbers
An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit delay, and assuming that all numbers have the usual binary encoding. The upper bound is within a factor (1 + ε) of Winograd’s lower bound (which holds for all encodings), where ε → 0 as n → ∞, and only O(n log n) circuit elements are required. CommentsOnly the Abst...
متن کاملAlgorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, September 16-22, 1979
When there are many people who don't need to expect something more than the benefits to take, we will suggest you to have willing to reach all benefits. Be sure and surely do to take this algorithms in modern mathematics and computer science proceedings urgench uzbek ssr september 16 2 that gives the best reasons to read. When you really need to get the reason why, this algorithms in modern mat...
متن کاملA New and Versatile Method for Association Generation
Current algorithms for nding associations among the attributes describing data in a database have a number of shortcomings Their performance time grows dramatically as the minimum support is reduced Conse quently applications that require associations with very small support have prohibitively large running times They assume a static database Some applications require generating associations in...
متن کامل